11 research outputs found
On the spectral radius of clique trees with a given zero forcing number
Let be the class of clique trees on vertices and zero forcing
number , where
and each block is a clique of size at least . In this article, we proved the
existence and uniqueness of a clique tree in that attains maximal
spectral radius among all graphs in . We also provide an upper bound
for the spectral radius of the extremal graph.Comment: 11 pages, 2 figures. arXiv admin note: text overlap with
arXiv:2301.1279
On the spectral radius of block graphs with a given dissociation number
In this manuscript, we consider the spectral radius of graphs in the class of
block graphs with a fixed number of vertices
and a given dissociation number . We first prove a few
elementary results on the adjacency matrix of a graph, the spectral radius and
a corresponding Perron vector. Using these results, we show a graph with
maximal spectral radius in satisfies a few
necessary properties. These properties guarantee the existence and uniqueness
of the block graph that maximize the spectral
radius in . Finally, we obtain bounds on the
spectral radius of
Inverse of the Squared Distance Matrix of a Complete Multipartite Graph
Let be a connected graph on vertices and be the length of
the shortest path between vertices and in . We set for
every vertex in . The squared distance matrix of is the
matrix with entry equal to if and equal to
if . For a given complete -partite graph
on vertices, under some condition
we find the inverse as a rank-one
perturbation of a symmetric Laplacian-like matrix with
. We also investigate the inertia of
.Comment: arXiv admin note: substantial text overlap with arXiv:2012.0434
On Squared Distance Matrix of Complete Multipartite Graphs
Let be a complete -partite graph on
vertices. The distance between vertices and in
, denoted by is defined to be the length of the shortest path
between and . The squared distance matrix of is the
matrix with entry equal to if and equal to
if . We define the squared distance energy
of to be the sum of the absolute values of its eigenvalues. We determine
the inertia of and compute the squared distance energy
. More precisely, we prove that if for , then and if , then
Furthermore, we show that
for a fixed value of and , both the spectral radius of the squared
distance matrix and the squared distance energy of complete -partite graphs
on vertices are maximal for complete split graph and minimal for
Tur{\'a}n graph